Bounding Procedures for Stochastic Dynamic Programs with Application to the Perimeter Patrol Problem
نویسندگان
چکیده
Myoungkuk Park Department of Mechanical Engineering, Texas A&M University, College Station, TX 77843, [email protected] Krishnamoorthy Kalyanam Infoscitex Corporation, Dayton, OH 45431, [email protected] Swaroop Darbha Department of Mechanical Engineering, Texas A&M University, College Station, TX 77843, [email protected] Phil Chandler Control Design & Analysis Branch, Air Force Research Laboratory, WPAFB, OH 45433, [email protected] Meir Pachter Electrical Engineering Department, Air Force Institute of Technology, WPAFB, OH 45433, [email protected]
منابع مشابه
Adversarial Uncertainty in Multi-Robot Patrol
We study the problem of multi-robot perimeter patrol in adversarial environments, under uncertainty of adversarial behavior. The robots patrol around a closed area using a nondeterministic patrol algorithm. The adversary’s choice of penetration point depends on the knowledge it obtained on the patrolling algorithm and its weakness points. Previous work investigated full knowledge and zero knowl...
متن کاملDynamic Facility Location with Stochastic Demand
Determination of facilities, such as factories or warehouses, location and availability conditions is one of the important and strategic decisions for an organization to make. Transportation costs that form a major part of goods price are dependent to this decision making. There are verity of methods have been presented to achieve the optimal locations of these facilities which are generally de...
متن کاملCombination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks
This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...
متن کاملUncertain Resource Availabilities: Proactive and Reactive Procedures for Preemptive Resource Constrained project Scheduling Problem
Project scheduling is the part of project management that deals with determining when intime to start (and finish) which activities and with the allocation of scarce resources to theproject activities. In practice, virtually all project managers are confronted with resourcescarceness. In such cases, the Resource-Constrained Project Scheduling Problem (RCPSP)arises. This optimization problem has...
متن کاملBarycentric Bounds in Stochastic Programming: Theory and Application
The design and analysis of efficient approximation schemes is of fundamental importance in stochastic programming research. Bounding approximations are particularly popular for providing strict error bounds that can be made small by using partitioning techniques. In this article we develop a powerful bounding method for linear multistage stochastic programs with a generalized nonconvex dependen...
متن کامل